Light paths in 4-connected graphs in the plane and other surfaces
نویسنده
چکیده
Several results concerning existence of k-paths, for which the sum of their vertex degrees is small, are presented.
منابع مشابه
Numerical Investigation of Birefringene Effect on the Light Reflection
In the present paper, the problem of light reflection from a birefringent medium and thin film is considered. First, the analytical equations governing the propagation of a plane and harmonic electromagnetic wave in an infinite, birefringent, linear, non-dispersive, non-absorbing, and non-magnetic medium is derived from Maxwell equations. Then, using phase matching condition and boundary condit...
متن کاملLight subgraphs of graphs embedded in the plane and in the projective plane – a survey –
It is well known that every planar graph contains a vertex of degree at most 5. A theorem of Kotzig states that every 3-connected planar graph contains an edge whose endvertices have degree-sum at most 13. Recently, Fabrici and Jendrol’ proved that every 3-connected planar graph G that contains a k-vertex path, a path on k vertices, contains also a k-vertex path P such that every vertex of P ha...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملA new proof that 4-connected planar graphs are Hamiltonian-connected
We prove a theorem guaranteeing special paths of faces in 2-connected plane graphs. As a corollary, we obtain a new proof of Thomassen’s theorem that every 4-connected planar graph is Hamiltonian-connected.
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2000